Call for Paper

We are inviting original papers describing research of theoretical or practical significance in computational, combinatorial and discrete geometry and related areas. Submissions will be refereed by the Program Committee. Submissions should not exceed six pages, excluding references and appendices. Documents must be prepared using LaTeX using the following template.

CCCG_2024_Latex_template.zip

Additional details of the paper that do not fit in the six pages can be included in a clearly marked appendix, which will be read at the discretion of the Program Committee. Papers that do not follow these guidelines will risk rejection without considering their merits.

Simultaneous submission to another conference or journal is not allowed. Accepted papers are expected to be presented in-person at the conference. At least one registration per accepted paper is required. Failure to do so will result in removal of the paper from the proceedings. Authors of selected papers will be invited to submit extended versions to a special issue of the open-access journal Computing in Geometry and Topology.

We are using Microsoft CMT system to manage paper submissions. Here is the link to the submission site: https://cmt3.research.microsoft.com/CCCG2024.

If you are using it for the first time, you will need to create an account. The submission form is self-explanatory. Under subject area, please specify a short description of the main (sub)area your submission belongs to. This information may be used in reviewer assignment process.

If you experience any difficulties with the submission, please email to rnishat@brocku.ca.

Double-Blind Review Process:

This year, we will have a double-blind review process for the regular papers, i.e., neither the authors nor the reviewers would know the identity of the other party during the review process. The authors are expected to take all reasonable steps to keep their identity hidden, including not listing their names or affiliations and omitting acknowledgements; that information will be included in the published version should the paper be accepted.

PhD Dissertation Award

This year we have an award for the best PhD dissertation on Computational Geometry. The award is open to any PhD thesis that was/will be defended between 1 January 2023 and the submission deadline of CCCG 2024, by a PhD student at any university (not restricted to Canadian universities).

A nomination should be submitted by the PhD student’s examining committee (e.g., by the thesis advisor). Please select “PhD dissertation” as your subject area during submission. In the zip file to submit, please include the following.

• The PhD dissertation in pdf format.
• A recommendation/evaluation letter (at most 3 pages) from the supervisor. An additional endorsement by a member of the supervisory committee may be submitted.
• A cover letter written by the thesis supervisor/advisor including the following information:
  • Name and email address of the candidate.
  • Title of the dissertation.
  • Department that has awarded the PhD and the name of the PhD program.
  • Date of the successful/scheduled defense of the thesis.

The Steering Committee of CCCG will evaluate the dissertations. The winner of the PhD award is expected to attend the conference to present a talk on their thesis and be presented with the award.

Camera-ready Submission

The camera-ready version of the accepted papers should be submitted on the CMT system by May 31. Please use the updated latex package from above, where author information can now be included that were previously excluded because of the double-blind review policy.

It is very important that the authors take into account all the comments and suggestions from the reviewers. Appendices are allowed, but it would be preferred if the material of the appendix can be brought into the main body of the paper to submit a complete version. There are no page limits for camera-ready, however, additional material that were not in the original submission are not allowed, unless asked by a reviewer.

The authors should submit a single zip file containing the source code of their submission and the compiled pdf. Proceedings will be published online only; no paper proceedings will be available. Simultaneous submission to another conference or journal is not allowed. Authors of selected papers will be invited to submit extended versions to a special issue of the open-access journal Computing in Geometry and Topology.

Important Dates:

(All times are 23:59 Anywhere on Earth)

Submission Deadline: April 05^th, 2024 (extended)

Notification Date: May 17^th, 2024 (extended)

Camera-Ready: May 31^st, 2024

Conference Dates: July 17^th – 19^th, 2024

Accommodation:

If you are planning to book your accommodation at the Brock Residence, you should do it during the registration. The deadline for booking Brock accommodation is July 8^th.

We have reserved some rooms at the Four Points by Sheraton Hotel near Brock campus with special rates for stays from July 16 to July 20. Each room would be equipped with 2 queen beds. Book your group rate for Canadian Conference on Computational Geometry- Brock.

Registration Fees:

The conference fees are shown in the table below. All prices are in Canadian Dollars (CDN).

Note that the fees quoted above do not include taxes. The conference fees include your:

• conference registration,
• coffee and lunch breaks,
• banquet on the evening of July 17^th.

• Our volunteers will be present in the South Block hallway every morning from 8.30 AM – 9.00 AM, where you can collect your programs and name tags.
• Each contributed talk is allocated a 25 minute slot. So you should plan your presentation for 20 minutes, plus 5 minutes for questions.
• The sessions will take place in the ground floor of the Thistle South Block, Room STH 216 and Room STH 217.
• All the invited talks (9.00 A.M. each morning) would take place at STH 216.
• The coffee break and the lunch break will take place in the South Block hallway just in front of Room STH 216 and Room STH 217, which can also be enjoyed in the lawn just outside if we have sunny weather.
• The banquet will take place in the Pond Inlet Refectory on July 17 from 6:00 P.M. – 8:30 P.M. We will take the conference group photo right before starting the banquet.
• The hike would start and end at the South Block hallway just in front of Room 216 and Room 217. At the end of the hike, some food (like pizzas) will be available in the hallway.
• The tour to Niagara Falls is complementary. The buses will pick the participants up at 1:00 P.M. from Village Road in front of the South Block building, and will drop off in front of Hershey Chocolate World in Niagara falls city around 1:30 P.M. The buses will again pick up the participants in front of the Hershey Chocolate World at 6:00 P.M., and drop off in front of the South Block building around 6:30 P.M.

Paul Erdős Memorial talk: Vašek Chvátal

Charles University (visiting), Prague, Czech Republic – Concordia University (emeritus), Montreal, Canada

Title of the talk: The discrete mathematical charms of Paul Erdős

Abstract: I will guide the audience through the eponymous book and highlight its juicier passages. The book was published by Cambridge University Press in 2021, the Association of American Publishers selected it as a finalist of its 2022 PROSE (Professional and Scholarly Excellence) Awards in the Mathematics category, and its Japanese translation appeared in 2023.

Short biography: Vašek Chvátal was born in Prague in 1946 and left Czechoslovakia on August 24, 1968. Having earned his PhD from University of Waterloo in 1970, he subsequently taught at McGill, Stanford, Université de Montréal, Rutgers,and finally Concordia, where he held the post of Canada Research Chair, first in Combinatorial Optimization (2004-2011) and then  in Discrete Mathematics (2011-2014). He resigned from this post in 2014 to join his wife Markéta in her move to Prague, where the two of them are living now.

His research interests include graph theory, combinatorics, discrete geometry, linear programming, analysis of algorithms, and combinatorial optimization. In 1983, he published a popular textbook Linear Programming. Between 1988 and 2007, he worked with David Applegate, Bob Bixby, and Bill Cook on the development of computer code Concorde for solving difficult instances of the traveling salesman problem. This team was awarded the Beale-Orchard Hays Prize in 2006 for their work and the Frederick W. Lanchester Prize in 2007 for their book The Traveling Salesman Problem: A Computational Study. In 2015, Chvátal shared with Jean Laserre the John von Neumann Theory Prize for his “seminal and profound contributions to the theoretical foundations of optimization”.

Godfried Toussaint Memorial talk: Anna Lubiw,

University of Waterloo, Waterloo, Canada

Title of the talk: Geometric Reconfiguration of Graphs Drawn in the Plane

Abstract: Reconfiguration is about changing one structure to another either through continuous motion or through discrete changes.  Geometric examples, from popular to deeply mathematical, include: transformers, the Rubik’s cube, mechanical linkages, and knot theory.   I will talk about some problems of reconfiguring curves in the plane, including the problem of morphing between two planar drawings of a graph.

Short biography: Anna Lubiw is an Emeritus Professor of Computer Science at the University of Waterloo. She has a Master of Mathematics degree in Combinatorics and Optimization from the University of Waterloo, and a PhD in Computer Science from the University of Toronto.
Her area of research is computational geometry and graph algorithms.  Specifically, she has recently worked on reconfiguration, morphing of graph drawings, folding and the mathematics of origami, triangulations, visibility, and shortest paths.

 Ferran Hurtado Memorial talk: Mark Keil,

University of Saskatchewan, Saskatoon, Canada

Title of the talk: Finding Cliques in Disk Graphs

Abstract: The 1980s saw the development of the first polynomial time algorithm for finding a maximum clique in a unit disk graph. Since then both graph theoretic and computational geometry tools have been used to develop improved algorithms for the unit disk case and approximation algorithms for general disks. In this talk I will cover some recent geometric approaches that speed up the clique algorithm for unit disks and find exact maximum cliques in some more general settings.

Short biography: Mark Keil is a Professor Emeritus in the Computer Science Department at the University of Saskatchewan. He has been at the University of Saskatchewan since  receiving his Ph.D. from the University of Toronto in 1993. His research interests include computational geometry and graph algorithms. Within computational geometry he has worked on polygon decomposition, geometric spanners, clustering, triangulations and visibility. His graph algorithms research has primarily concerned geometrically defined intersection graphs.

1. Travel

1.1 By Car

1.1.1 From Lester B. Pearson Airport in Toronto

From Highway 401 West, take 403 South to the Queen Elizabeth Highway (QEW) in the direction of Niagara Falls. Follow the Queen Elizabeth Way around the lake, then Southeast to St. Catharines. Take exit 49, which will lead you onto Highway 406. Continue until you reach St. David’s Road. Take the St. David’s Road West Exit and follow until you reach Sir Isaac Brock Way.

1.1.2 From Hamilton Airport

Turn left on Airport Road. Turn left on Hwy. 6 (Upper James Street) and continue to the Lincoln Alexander Parkway (the ‘LINC’). Turn east on the Lincoln Alexander Parkway which will turn into the Red Hill Parkway. Take the Red Hill Parkway to the Queen Elizabeth Way (QEW) east to Niagara Falls. At Exit 49, turn onto Highway 406 (towards Welland/Port Colborne) and continue until you reach St. David Road. Take the St. David’s Road West Exit and follow until you reach Sir Isaac Brock Way.

1.1.3 From Buffalo (Peace Bridge)

Cross the Peace bridge and then take the Queen Elizabeth Way (QEW) towards Toronto. At Exit 32B, turn onto Thorold Stone Road West and continue through the Thorold Tunnel where the road becomes Highway 58. Take the St. David’s Road West exit and follow until you reach Sir Isaac Brock Way.

1.1.4 Park at Brock Campus

Upon arrival to campus choose the Glenridge entrance (it has a roundabout just after you turn in) for standard check-ins. Conferences may have special check-in instructions, please consult with your group organizer. Follow the signs that say “Accommodation Check-In”. While you check-in, you may park outside the front of the Conference Centre. After checking in place the parking pass provided on your dash and park in your assigned lot.

Please park in Zone 1 – labelled as FREE PARKING on the map below.

You may also wish to use our  Interactive Campus Map

Program Committee

Organizing Committee

Volunteers